Structural Results for General Partition, Equistable and Triangle graphs
نویسندگان
چکیده
Miklavič and Milanič (2011) introduced the connections among the classes of equistable, general partition and triangle graphs. We present results concerning the three classes aforementioned. In particular, we show that the general partition and triangle classes are both closed under the operations of substitution, induction and contraction of modules. Moreover, we show that the triangle condition is sufficient for a planar graph to be a general partition graph, providing a generalisation of a result by Mahadev, Peled and Sun (1994) on equistable outerplanar graphs.
منابع مشابه
Equistarable bipartite graphs
Recently, Milanič and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges is of total weight 1 if and only if it forms a maximal star. Based on equistarable graphs, counterexamples to three conjectures on equistable graphs were constructed, in particular to Orlin’s conjecture, which states ...
متن کاملEquistarable graphs and counterexamples to three conjectures on equistable graphs
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight 1. In 1994, Mahadev et al. introduced a subclass of equistable graphs, called strongly equistable graphs, as graphs such that for every c ≤ 1 and every non-empty subset T of vertices that is not a maximal stable set, there exist positive...
متن کاملStructural Results for Equistable Graphs and Related Graph Classes
The class of equistable graphs is defined by the existence of a weight structure on the vertices where maximal stable sets are characterized by their weights. This class, not contained in any nontrivial hereditary class, has been studied both from a structural and an algorithmic point of view, however no combinatorial characterization is known for these graphs. We present some structural result...
متن کاملEquistable series-parallel graphs
A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series-parallel graphs that are equistable, generalizing results of Mahadev, Peled and Sun about equistable outer-planar graphs.
متن کاملComplexity results for equistable graphs and related classes
The class of equistable graphs is defined by the existence of a cost structure on the vertices such that the maximal stable sets are characterized by their costs. This graph class, not contained in any nontrivial hereditary class, has so far been studied mostly from a structural point of view; characterizations and polynomial time recognition algorithms have been obtained for special cases. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 49 شماره
صفحات -
تاریخ انتشار 2015